Almost disjoint families of connected sets
نویسندگان
چکیده
We investigate the question which (separable metrizable) spaces have a ‘large’ almost disjoint family of connected (and locally connected) sets. Every compact space of dimension at least 2 as well as all compact spaces containing an ‘uncountable star’ have such a family. Our results show that the situation for 1-dimensional compacta is unclear. 2004 Elsevier B.V. All rights reserved.
منابع مشابه
A Special Class of Almost Disjoint Families
The collection of branches (maximal linearly ordered sets of nodes) of the tree ω (ordered by inclusion) forms an almost disjoint family (of sets of nodes). This family is not maximal – for example, any level of the tree is almost disjoint from all of the branches. How many sets must be added to the family of branches to make it maximal? This question leads to a series of definitions and result...
متن کاملStrongly Almost Disjoint Sets and Weakly Uniform Bases
A combinatorial principle CECA is formulated and its equivalence with GCH + certain weakenings of 2λ for singular λ is proved. CECA is used to show that certain “almost point-< τ” families can be refined to point-< τ families by removing a small set from each member of the family. This theorem in turn is used to show the consistency of “every first countable T1-space with a weakly uniform base ...
متن کاملHow to drive our families mad
Given a family F of pairwise almost disjoint (ad) sets on a countable set S, we study families F̃ of maximal almost disjoint (mad) sets extending F . We define a+(F) to be the minimal possible cardinality of F̃ \F for such F̃ and a+(κ) = max{a+(F) : | F | ≤ κ}. We show that all infinite cardinal less than or equal to the continuum c can be represented as a+(F) for some ad F (Theorem 21) and that t...
متن کاملMad Families and Their Neighbors
We study several sorts of maximal almost disjoint families, both on a countable set and on uncountable, regular cardinals. We relate the associated cardinal invariants with bounding and dominating numbers and also with the uniformity of the meager ideal and some of its generalizations. 1. Who Are These Families? A Background Check Almost disjoint (ad) families have been a topic of interest in s...
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005